Presenting functors on many-sorted varieties and applications

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Presenting functors on many-sorted varieties and applications

This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of this notion from the one-sorted to the many-sorted case has several interesting consequences. First, it can be applied to give equational logic for the binding algebras modelling abstract syntax. Second, it provides a ca...

متن کامل

On the Trivial Many Sorted Algebras and Many Sorted Congruences

In this paper a, I denote sets and S denotes a non empty non void many sorted signature. The scheme MSSExD deals with a non empty set A and a binary predicate P , and states that: There exists a many sorted set f indexed by A such that for every element i of A holds P [i, f (i)] provided the following condition is met: • For every element i of A there exists a set j such that P [i, j]. Let I be...

متن کامل

Functorial Coalgebraic Logic: The Case of Many-sorted Varieties

Following earlier work, a modal logic for T -coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result characterizing those functors that have presentations is generalized from endofunctors on one-sorted varieties to functors between many-sorted varieties. This yie...

متن کامل

Notes on Many-Sorted Logic

Preface, p. vii Any reasonable logical system can be naturally translated into many-sorted first-order logic; thus many-sorted first-order logic is a universal logic. Since many-sorted logic can be translated into single-sorted first-order logic the latter is also universal. However, as will be seen in the course of this book, many-sorted logic faithfully interprets the semantics of the object ...

متن کامل

Priestley Duality for Many Sorted Algebras and Applications

In this work we develop a categorical duality for certain classes of manysorted algebras, called many-sorted lattices because each sort admits a structure of distributive lattice. This duality is strongly based on the Priestley duality for distributive lattices developed in [3] and [4] and on the representation of many sorted lattices with operators given by Sofronie-Stokkermans in [6]. In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2010

ISSN: 0890-5401

DOI: 10.1016/j.ic.2009.11.007